首页> 外文OA文献 >Hardware Efficient Approximative Matrix Inversion for Linear Pre-Coding in Massive MIMO
【2h】

Hardware Efficient Approximative Matrix Inversion for Linear Pre-Coding in Massive MIMO

机译:大规模mImO中线性预编码的硬件高效近似矩阵求逆

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper describes a hardware efficient linear pre-coder for Massive MIMO Base Stations (BSs) comprising a very large number of antennas, say, in the order of 100s, serving multiple users simultaneously. To avoid hardware demanding direct matrix inversions required for the Zero-Forcing (ZF) pre-coder, we use low complexity Neumann series based approximations. Furthermore, we propose a method to speed-up the convergence of the Neumann series by using tri-diagonal pre-condition matrices, which lowers the complexity even further. As a proof of concept a flexible VLSI architecture is presented with an implementation supporting matrix inversion of sizes up-to 16 × 16. In 65 nm CMOS, a throughput of 0.5M matrix inversions per sec is achieved at clock frequency of 420 MHz with a 104K gate count.
机译:本文介绍了一种适用于大规模MIMO基站(BS)的硬件高效线性预编码器,该预编码器包含大量天线(例如100s数量级),可同时为多个用户提供服务。为避免硬件要求零强制(ZF)预编码器所需的直接矩阵求逆,我们使用了基于低复杂度Neumann级数的近似值。此外,我们提出了一种使用三对角前提矩阵来加速Neumann级数收敛的方法,从而进一步降低了复杂度。作为概念验证,提出了一种灵活的VLSI架构,其实现支持最​​大尺寸为16×16的矩阵求逆。在65 nm CMOS中,在420 MHz的时钟频率下,每秒可实现0.5M矩阵求逆的吞吐量。 104K门数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号